A Faster Algorithm for the Perfect Phylogeny Problem when the Number of Characters is Fixed
نویسندگان
چکیده
We present an algorithm for determining whether a set of species, described by the characters they exhibit, has a perfect phylogeny, assuming the maximum number of characters is fixed. This algorithm is simpler and faster than the known algorithms when the number of characters is at least 4. Disciplines Theory and Algorithms This article is available at Iowa State University Digital Repository: http://lib.dr.iastate.edu/cs_techreports/15 A Faster Algorithm for the Perfect Phylogeny Problem when the number of Characters is Fixed TR94-05 Richa Agarwala and David Fernandez-Baca
منابع مشابه
Haplotype Block Partitioning and tagSNP Selection under the Perfect Phylogeny Model
Single Nucleotide Polymorphisms (SNPs) are the most usual form of polymorphism in human genome.Analyses of genetic variations have revealed that individual genomes share common SNP-haplotypes. Theparticular pattern of these common variations forms a block-like structure on human genome. In this work,we develop a new method based on the Perfect Phylogeny Model to identify haplo...
متن کاملA Faster Algorithm for the Perfect PhylogenyProblem when the Number of Characters is
We present an algorithm for determining whether a set of species, described by the characters they exhibit, has a perfect phylogeny, assuming the maximum number of characters is xed. This algorithm is simpler and faster than the known algorithms when the number of characters is at least 4.
متن کاملA Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed
C1) S c V ( T ) c A1 x . . . x A,, W e present a polynomial-t ime algorithm f o r determining whether a set of species, described by the characters they exhibit, has a perfect phylogeny, assuming the max imum number of possible s ta tes f o r a charact e r is fixed. Th i s solves a longstanding open problem. O u r result should be contrasted wi th the proof by Steel and Bodlaender, Fellows, and...
متن کاملFast Algorithms for Inferring Evolutionary Trees
We present algorithms for the perfect phylogeny problem restricted to binary characters. The first algorithm is faster than a previous algorithm by Gusfield when the input matrix for the problem is sparse. Next, we present two online algorithms. For the first of these, the set of species is fixed and the characters are given as input one at a time, while, for the second, the set of characters i...
متن کاملFPT Algorithms for Binary Near-Perfect Phylogenetic Trees
We consider the problem of reconstructing near-perfect phylogenetic trees using binary character states (referred to as BNPP). A perfect phylogeny assumes that every character mutates at most once in the evolutionary tree, yielding an algorithm for binary character states that is computationally efficient but not robust to imperfections in real data. A near-perfect phylogeny relaxes the perfect...
متن کامل